DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3k

نویسندگان

  • RALF BUNDSCHUH
  • PETER BUNDSCHUH
چکیده

Let F0 = 0, F1 = 1, and Fn = Fn−1 + Fn−2 for n ≥ 2 denote the sequence F of Fibonacci numbers. For any modulus m ≥ 2 and residue b (modm), denote by vF (m, b) the number of occurrences of b as a residue in one (shortest) period of F modulo m. Moreover, let vL(m, b) be similarly defined for the Lucas sequence L satisfying L0 = 2, L1 = 1, and Ln = Ln−1 + Ln−2 for n ≥ 2. In this paper, completing the recent partial work of Shiu and Chu we entirely describe the functions vF (3 , .) and vL(3 , .) for every positive integer k. Using a notion formally introduced by Carlip and Jacobson, our main results imply that neither F nor L is stable modulo 3. Moreover, in terms of another notion introduced by Somer and Carlip, we observe that L is a multiple of a translation of F modulo 3 (and conversely) for every k.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trigonometric Expressions for Fibonacci and Lucas Numbers

The amount of literature bears witness to the ubiquity of the Fibonacci numbers and the Lucas numbers. Not only these numbers are popular in expository literature because of their beautiful properties, but also the fact that they ‘occur in nature’ adds to their fascination. Our purpose is to use a certain polynomial identity to express these numbers in terms of trigonometric functions. It is in...

متن کامل

Mixing Properties of Mixed Chebyshev Polynomials

1. Robert P. Backstrom. "On the Determination of the Zeros of the Fibonacci Sequence." The Fibonacci Quarterly 4, No. 4 (1966):313-322. 2. R. D. Carmichael. "On the Numerical Factors of the Arithmetic Forms a + 3." Annals of Mathematics9 2nd Ser. 15 (1913):30-70. 3. John H. Halton. "On the Divisibility Properties of Fibonacci Numbers." The Fibonacci Quarterly 4, No. 3 (1966):217-240. 4. D.H. Le...

متن کامل

The Sequence of Lucas Numbers Is Not Stable modulo 2 and 5

Let L0 = 2, L1 = 1, and Ln = Ln−1+Ln−2 for n ≥ 2, denote the sequence L of Lucas numbers. For any modulus m ≥ 2, and residue b (mod m), denote by vL(m, b) the number of occurrences of b as a residue in one (shortest) period of L modulo m. In this paper, we completely describe the functions vL(p , .) for k ≥ 1 in the cases p = 2 and p = 5. Using a notion formally introduced by Carlip and Jacobso...

متن کامل

Divisibility Properties by Multisection

The/?-adic order, vp(r), of r is the exponent of the highest power of a prime/? which divides r. We characterize the/?-adic order vp(Fn) of the F„ sequence using multisection identities. The method of multisection is a helpful tool in discovering and proving divisibility properties. Here it leads to invariants of the modulo p Fibonacci generating function for p ^ 5. The proof relies on some sim...

متن کامل

Nonexistence of Even Fibonacci Pseudoprimes of The

With regard to this problem, Di Porto and Filipponi, in [4], conjectured that there are no even-Fibonacci pseudoprimes of the 1 kind, providing some constraints are placed on their existence, and Somer, in [12], extends these constraints by stating some very interesting theorems. Moreover, in [1], a solution has been found for a similar problem, that is, for the sequence {Vn(2,1)}, defined by F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011